0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n089.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 18:37:54 CST 2018
0.00/0.21	% done 10 iterations in 0.018s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff('thm/iterate/nsum_', axiom,
0.00/0.21	  (![A:$tType]:
0.00/0.21	     ('const/iterate/nsum'(A) =
0.00/0.21	      'const/iterate/iterate'(A,'type/nums/num','const/arith/+')))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X0 : $tType]:
0.00/0.21	      'const/iterate/nsum'(X0)
0.00/0.21	       = 'const/iterate/iterate'(X0, 'type/nums/num', 'const/arith/+'),
0.00/0.21	    inference('cnf', [status(esa)], [thm/iterate/nsum_])).
0.00/0.21	tff('1', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > 'type/nums/num']:
0.00/0.21	      'const/iterate/nsum'(X0, X1, X2)
0.00/0.21	       = 'const/iterate/iterate'(X0, 'type/nums/num', 'const/arith/+', X1, 
0.00/0.21	           X2),
0.00/0.21	    inference('ho_complete_eq', [status(thm)], ['0'])).
0.00/0.21	tff('thm/iterate/ITERATE_DELETE_', axiom,
0.00/0.21	  (![A:$tType,B:$tType,A0:((B * B) > B)]:
0.00/0.21	     ('const/iterate/monoidal'(B,A0) =>
0.00/0.21	      (![A1:(A > B),A2:(A > $o),A3:A]:
0.00/0.21	         (('const/sets/IN'(A,A3,A2) & 'const/sets/FINITE'(A,A2)) =>
0.00/0.21	          (A0(A1(A3),
0.00/0.21	              'const/iterate/iterate'(A,B,A0,'const/sets/DELETE'(A,A2,A3),A1)) =
0.00/0.21	           'const/iterate/iterate'(A,B,A0,A2,A1))))))).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X1 : $tType, X2 : $tType, X3 : (X2 * X2) > X2, X4 : X1 > $o, 
0.00/0.21	      X5 : X1 > X2, X6 : X1]:
0.00/0.21	      (X3(X5(X6), 
0.00/0.21	         'const/iterate/iterate'(X1, X2, X3, 
0.00/0.21	           'const/sets/DELETE'(X1, X4, X6), X5))
0.00/0.21	        = 'const/iterate/iterate'(X1, X2, X3, X4, X5)
0.00/0.21	       | ~ 'const/sets/IN'(X1, X6, X4)
0.00/0.21	       | ~ 'const/sets/FINITE'(X1, X4)
0.00/0.21	       | ~ 'const/iterate/monoidal'(X2, X3)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/iterate/ITERATE_DELETE_])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X1 : $tType, X2 : $tType, X3 : (X2 * X2) > X2, X4 : X1 > $o, 
0.00/0.21	      X5 : X1 > X2, X6 : X1, X7 : (X2 * X2) > X2, X8 : X1 > X2]:
0.00/0.21	      (X8 != X5
0.00/0.21	       | X7 != X3
0.00/0.21	       | X3(X5(X6), 
0.00/0.21	           'const/iterate/iterate'(X1, X2, X7, 
0.00/0.21	             'const/sets/DELETE'(X1, X4, X6), X8))
0.00/0.21	          = 'const/iterate/iterate'(X1, X2, X7, X4, X8)
0.00/0.21	       | ~ 'const/sets/IN'(X1, X6, X4)
0.00/0.21	       | ~ 'const/sets/FINITE'(X1, X4)
0.00/0.21	       | ~ 'const/iterate/monoidal'(X2, X7)),
0.00/0.21	    inference('ho.purify_applied_variable', [status(thm)], ['2'])).
0.00/0.21	tff('4', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > 'type/nums/num', X2 : X0, X3 : X0 > $o, 
0.00/0.21	      X4 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num', 
0.00/0.21	      X5 : X0 > 'type/nums/num']:
0.00/0.21	      (X4(X5(X2), 
0.00/0.21	         'const/iterate/nsum'(X0, 'const/sets/DELETE'(X0, X3, X2), X1))
0.00/0.21	        = 'const/iterate/iterate'(X0, 'type/nums/num', 'const/arith/+', X3, 
0.00/0.21	            X1)
0.00/0.21	       | ~ 'const/iterate/monoidal'('type/nums/num', 'const/arith/+')
0.00/0.21	       | ~ 'const/sets/FINITE'(X0, X3)
0.00/0.21	       | ~ 'const/sets/IN'(X0, X2, X3)
0.00/0.21	       | 'const/arith/+' != X4
0.00/0.21	       | X1 != X5),
0.00/0.21	    inference('sup+', [status(thm)], ['1', '3'])).
0.00/0.21	tff('thm/iterate/MONOIDAL_ADD_', axiom,
0.00/0.21	  ('const/iterate/monoidal'('type/nums/num','const/arith/+'))).
0.00/0.21	tff('5', plain, 'const/iterate/monoidal'('type/nums/num', 'const/arith/+'),
0.00/0.21	    inference('cnf', [status(esa)], [thm/iterate/MONOIDAL_ADD_])).
0.00/0.21	tff('6', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > 'type/nums/num', X2 : X0, X3 : X0 > $o, 
0.00/0.21	      X4 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num', 
0.00/0.21	      X5 : X0 > 'type/nums/num']:
0.00/0.21	      (X4(X5(X2), 
0.00/0.21	         'const/iterate/nsum'(X0, 'const/sets/DELETE'(X0, X3, X2), X1))
0.00/0.21	        = 'const/iterate/nsum'(X0, X3, X1)
0.00/0.21	       | ~ $true
0.00/0.21	       | ~ 'const/sets/FINITE'(X0, X3)
0.00/0.21	       | ~ 'const/sets/IN'(X0, X2, X3)
0.00/0.21	       | 'const/arith/+' != X4
0.00/0.21	       | X1 != X5),
0.00/0.21	    inference('demod', [status(thm)], ['4', '1', '5'])).
0.00/0.21	tff('7', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > 'type/nums/num', X2 : X0, X3 : X0 > $o, 
0.00/0.21	      X4 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num', 
0.00/0.21	      X5 : X0 > 'type/nums/num']:
0.00/0.21	      (X1 != X5
0.00/0.21	       | 'const/arith/+' != X4
0.00/0.21	       | ~ 'const/sets/IN'(X0, X2, X3)
0.00/0.21	       | ~ 'const/sets/FINITE'(X0, X3)
0.00/0.21	       | X4(X5(X2), 
0.00/0.21	           'const/iterate/nsum'(X0, 'const/sets/DELETE'(X0, X3, X2), X1))
0.00/0.21	          = 'const/iterate/nsum'(X0, X3, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['6'])).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > 'type/nums/num', X2 : X0, X3 : X0 > $o, 
0.00/0.21	      X4 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num', 
0.00/0.21	      X5 : X0 > 'type/nums/num', 
0.00/0.21	      X6 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num']:
0.00/0.21	      (X6 != X4
0.00/0.21	       | X1 != X5
0.00/0.21	       | 'const/arith/+' != X4
0.00/0.21	       | ~ 'const/sets/IN'(X0, X2, X3)
0.00/0.21	       | ~ 'const/sets/FINITE'(X0, X3)
0.00/0.21	       | X6(X5(X2), 
0.00/0.21	           'const/iterate/nsum'(X0, 'const/sets/DELETE'(X0, X3, X2), X1))
0.00/0.21	          = 'const/iterate/nsum'(X0, X3, X1)),
0.00/0.21	    inference('ho.purify_applied_variable', [status(thm)], ['7'])).
0.00/0.21	tff('thm/iterate/NSUM_DELETE_', conjecture,
0.00/0.21	  (![A:$tType,A0:(A > 'type/nums/num'),A1:(A > $o),A2:A]:
0.00/0.21	     (('const/sets/IN'(A,A2,A1) & 'const/sets/FINITE'(A,A1)) =>
0.00/0.21	      ('const/arith/+'(A0(A2),
0.00/0.21	                       'const/iterate/nsum'(A,'const/sets/DELETE'(A,A1,A2),A0)) =
0.00/0.21	       'const/iterate/nsum'(A,A1,A0))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (![A:$tType,A0:(A > 'type/nums/num'),A1:(A > $o),A2:A]:
0.00/0.21	       (('const/sets/IN'(A,A2,A1) & 'const/sets/FINITE'(A,A1)) =>
0.00/0.21	        ('const/arith/+'(A0(A2),
0.00/0.21	                         'const/iterate/nsum'(A,'const/sets/DELETE'(A,A1,A2),
0.00/0.21	                                              A0)) =
0.00/0.21	         'const/iterate/nsum'(A,A1,A0)))))).
0.00/0.21	tff('9', plain,
0.00/0.21	    'const/arith/+'(sk_A0(sk_A2), 
0.00/0.21	      'const/iterate/nsum'(sk_A, 'const/sets/DELETE'(sk_A, sk_A1, sk_A2), 
0.00/0.21	        sk_A0))
0.00/0.21	     != 'const/iterate/nsum'(sk_A, sk_A1, sk_A0),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('10', plain,
0.00/0.21	    ![X0 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num']:
0.00/0.21	      ('const/iterate/nsum'(sk_A, sk_A1, sk_A0)
0.00/0.21	        != 'const/iterate/nsum'(sk_A, sk_A1, sk_A0)
0.00/0.21	       | ~ 'const/sets/FINITE'(sk_A, sk_A1)
0.00/0.21	       | ~ 'const/sets/IN'(sk_A, sk_A2, sk_A1)
0.00/0.21	       | 'const/arith/+' != X0
0.00/0.21	       | sk_A0 != sk_A0
0.00/0.21	       | 'const/arith/+' != X0),
0.00/0.21	    inference('sup-', [status(thm)], ['8', '9'])).
0.00/0.21	tff('11', plain, 'const/sets/FINITE'(sk_A, sk_A1),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('12', plain, 'const/sets/IN'(sk_A, sk_A2, sk_A1),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('13', plain,
0.00/0.21	    ![X0 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num']:
0.00/0.21	      ('const/iterate/nsum'(sk_A, sk_A1, sk_A0)
0.00/0.21	        != 'const/iterate/nsum'(sk_A, sk_A1, sk_A0)
0.00/0.21	       | ~ $true
0.00/0.21	       | ~ $true
0.00/0.21	       | 'const/arith/+' != X0
0.00/0.21	       | sk_A0 != sk_A0
0.00/0.21	       | 'const/arith/+' != X0),
0.00/0.21	    inference('demod', [status(thm)], ['10', '11', '12'])).
0.00/0.21	tff('14', plain,
0.00/0.21	    ![X0 : ('type/nums/num' * 'type/nums/num') > 'type/nums/num']:
0.00/0.21	      'const/arith/+' != X0,
0.00/0.21	    inference('simplify', [status(thm)], ['13'])).
0.00/0.21	tff('15', plain, $false, inference('eq_res', [status(thm)], ['14'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
